On edge intersection graphs of paths with 2 bends
نویسندگان
چکیده
منابع مشابه
On Edge Intersection Graphs of Paths with 2 Bends
An EPG-representation of a graph G is a collection of paths in a plane square grid, each corresponding to a single vertex of G, so that two vertices are adjacent if and only if their corresponding paths share infinitely many points. In this paper we focus on graphs admitting EPG-representations by paths with at most 2 bends. We show hardness of the recognition problem for this class of graphs, ...
متن کاملEdge intersection graphs of systems of grid paths with bounded number of bends
We answer some of the questions raised by Golumbic, Lipshteyn and Stern regarding edge intersection graphs of paths on a grid (EPG graphs). We prove that for any d ≥ 4, in order to represent all n vertex graphs with maximum degree d as edge intersection graphs of n paths, a grid of area Θ(n2) is needed. A bend is a turn of a path at a grid point. Let Bk be the class of graphs that have an EPG r...
متن کاملEdge intersection graphs of single bend paths on a grid
We combine the known notion of the edge intersection graphs of paths in a tree with a VLSI grid layout model to introduce the edge intersection graphs of paths on a grid. Let P be a collection of nontrivial simple paths on a grid G. We define the edge intersection graph EPG(P) of P to have vertices which correspond to the members of P, such that two vertices are adjacent in EPG(P) if the corres...
متن کاملRepresentations of Edge Intersection Graphs of Paths in a Tree
Let P be a collection of nontrivial simple paths in a tree T . The edge intersection graph of P , denoted by EPT (P), has vertex set that corresponds to the members of P , and two vertices are joined by an edge if the corresponding members of P share a common edge in T . An undirected graph G is called an edge intersection graph of paths in a tree, if G = EPT (P) for some P and T . The EPT grap...
متن کاملEdge-Intersection Graphs of k-Bend Paths in Grids
Edge-intersection graphs of paths in grids are graphs that can be represented with vertices as paths in grids and edges between the vertices of the graph exist whenever two grid paths share a grid edge. This type of graphs is motivated by applications in conflict resolution of paths in grid networks. In this paper, we continue the study of edge-intersection graphs of paths in a grid, which was ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2017
ISSN: 0166-218X
DOI: 10.1016/j.dam.2017.04.023